The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
نویسندگان
چکیده
We analyse the computability and the complexity of various definitions of spectral radii for sets of matrices. We show that the joint and generalized spectral radii of two integer matrices are not approximable in polynomial time, and that two related quantities – the lower spectral radius and the largest Lyapunov exponent – are not algorithmically approximable.
منابع مشابه
Joint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra
In this paper, we discuss some properties of joint spectral {radius(jsr)} and generalized spectral radius(gsr) for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized spectral radius. Some of these are in scalar matrices, but some are different. For example for a bounded set of scalar matrices,$Sigma$, $r_*...
متن کاملCartesian decomposition of matrices and some norm inequalities
Let X be an n-square complex matrix with the Cartesian decomposition X = A + i B, where A and B are n times n Hermitian matrices. It is known that $Vert X Vert_p^2 leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)$, where $p geq 2$ and $Vert . Vert_p$ is the Schatten p-norm. In this paper, this inequality and some of its improvements ...
متن کاملThe generalized spectral radius and extremal norms
The generalized spectral radius, also known under the name of joint spectral radius, or (after taking logarithms) maximal Lyapunov exponent of a discrete inclusion is examined. We present a new proof for a result of Barabanov, which states that for irreducible sets of matrices an extremal norm always exists. This approach lends itself easily to the analysis of further properties of the generali...
متن کاملApproximating the spectral radius of sets of matrices in the max-algebra is NP-hard
The lower and average spectral radii measure the minimal and average growth rates, respectively, of long products of matrices taken from a finite set. The logarithm of the average spectral radius is traditionally called the Lyapunov exponent. When one forms these products in the maxalgebra, we obtain quantities that measure the performance of Discrete Event Systems. We show that approximating t...
متن کاملOverlap-free words and spectra of matrices
Overlap-free words are words over the binary alphabet A = {a, b} that do not contain factors of the form xvxvx, where x ∈ A and v ∈ A. We analyze the asymptotic growth of the number un of overlap-freewords of length n as n→∞. We obtain explicit formulas for theminimal andmaximal rates of growth of un in terms of spectral characteristics (the joint spectral subradius and the joint spectral radiu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- MCSS
دوره 10 شماره
صفحات -
تاریخ انتشار 1997